The Algebraic Measure of a Hidden Markov Quantum Memory Channel
نویسندگان
چکیده
This paper was presented in poster form at and in the proceedings of the QCMC 2008. It is a summary of a fuller paper to appear separately. The classical product state capacity of a noisy quantum channel with memory is investigated. A forgetful noise-memory channel is constructed by Markov switching between two depolarizing channels which introduces non-Markovian noise correlations between successive channel uses. This function of a Markov process can be reformulated as an algebraic measure. This framework provides an expression for the asymptotic entropy rate and thus enables the calculation of the classical capacity. The effects of the hidden-Markovian memory on the capacity are explored. An increase in noise-correlations is found to increase the capacity.
منابع مشابه
Relative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملGENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For noisy quantum channel, a quantum error correcting code of dimension k exists if and only if the associated joint rank-k numerical range is non-empty. In this paper the notion of joint rank-k numerical range is generalized and some statements of [2011, Generaliz...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملar X iv : 0 90 7 . 09 82 v 3 [ qu an t - ph ] 8 D ec 2 00 9 Capacity of a bosonic memory channel with Gauss - Markov noise
We address the classical capacity of a quantum bosonic memory channel with additive noise, subject to an input energy constraint. The memory is modeled by correlated noise emerging from a Gauss-Markov process. Under reasonable assumptions, we show that the optimal modulation results from a “quantum water-filling” solution above a certain input energy threshold, similar to the optimal modulation...
متن کامل